Method and apparatus for ranked join indices

ABSTRACT

A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.

CROSS-REFERENCES TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 11/676,470, filed Feb. 19, 2007, now U.S. Pat. No. 7,664,749 currently allowed and is a continuation of U.S. patent application Ser. No. 10/775,056 filed Feb. 9, 2004, now, U.S. Pat. No. 7,185,012, which claims the benefit of U.S. Provisional Application No. 60/446,237, filed Feb. 10, 2003, where all of the above cited applications are herein incorporated by reference in their entirety.

FIELD OF THE INVENTION

The present invention relates generally to the ranking of data entities and, more particularly, to a method and apparatus for ranked join indices.

BACKGROUND OF THE INVENTION

Many data sources contain data entities that may be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ranking of the entities according to the values in an attribute domain. Such values may reflect various quantities of interest for the entities, such as physical characteristics, quality, reliability or credibility to name a few. Such attributes are referred to as rank attributes. The domain of rank attributes depends on their semantics. For example, the domain could either consist of categorical values (e.g., service can be excellent, fair or poor) or numerical values (e.g., an interval of continuous values). The existence of rank attributes along with data entities leads to enhanced functionality and query processing capabilities.

Typically, users specify their preferences toward specific attributes. Preferences are expressed in the form of numerical weights, assigned to rank attributes. Query processors incorporate functions that weight attribute values by user preference, deriving scores for individual entities. Several techniques have been developed to perform query processing with the goal of identifying results that optimize such functions. A typical example is a query that seeks to quickly identify k data entities that yield best scores among all entities in the database. At an abstract level, such queries can be considered as generalized forms of selection queries.

Several prior art techniques disclose a framework for preference based query processing. Such works consider realizations of a specific instance of this framework, namely top-k selection queries, that is, quickly identifying k tuples that optimize scores assigned by monotone linear scoring functions on a variety of ranked attributes and user specified preferences. Most of these techniques for answering top-k selection queries, however, are not based on indexing. Instead, they are directed towards optimizing the number of tuples examined in order to identify the answer under various cost models of interest. Such optimizations include minimization of tuples read sequentially from the input or minimization of random disk access.

However, the few available techniques that do disclose indexing for answering top-k selection queries do not provide guarantees for performance and in the worst case, an entire data set has to be examined in order to identify the correct answer to a top-k selection query.

SUMMARY OF THE INVENTION

The inventors disclose herein a technique, referred to by the inventors as ranked join index, for efficiently providing solutions to top-k join queries for arbitrary, user specified preferences and a large class of scoring functions. The rank join index technique of the present invention requires small space (i.e., as compared to an entire join result) and provides performance guarantees. Moreover, the present invention provides a tradeoff between space requirements and worst-case search performance.

In one embodiment of the present invention a method of creating a ranked join index for ordered data entries includes determining a dominating set of the ordered data entries, mapping the dominating set of ordered data entries according to rank attributes, determining a separating vector for each set of adjacent mapped data entries, and ordering and indexing the data entries according to a separating point associated with each of the separating vectors.

BRIEF DESCRIPTION OF THE DRAWINGS

The teaching of the present invention can be readily understood by considering the following detailed description in conjunction with the accompanying drawings, in which:

FIG. 1 depicts two tables each comprising a list of attributes and rankings for the attributes;

FIG. 2 depicts an embodiment of an algorithm for computing the dominating set for substantially any value of K, where K depicts an upper bound for the maximum requested result size of any top-k join query;

FIGS. 3 a and 3 b graphically depict an example of a Dominating Set determined by a Dominating set algorithm for tables and rank attributes having different join results;

FIG. 4 a graphically depicts an example of the ordering of two tuples when a vector has a positive slope;

FIG. 4 b graphically depicts an example of the ordering of the two tuples for a second case when a vector has an other than positive slope;

FIG. 5 depicts an embodiment of an RJI Construct algorithm of the present invention, which preprocesses a set of tuples and constructs an index on its elements;

FIG. 6 a and FIG. 6 b graphically depict an example of the operation of the RJI Construct algorithm;

FIGS. 7 a, 7 b and 7 c graphically depict an example of the space-time tradeoffs of the RJI Construct algorithm of FIG. 5;

FIG. 8 a and FIG. 8 b graphically depict an embodiment of an R-tree with three MBRs and a top-k join query;

FIG. 9 depicts an embodiment of a TopKrtree Answer algorithm of the present invention; and

FIG. 10 depicts a high level block diagram of an embodiment of a controller suitable for performing the methods of the present invention.

To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures.

DETAILED DESCRIPTION

Although various embodiments of the present invention herein are being described with respect to techniques for providing performance guarantees for top-k join queries over two relations, it will be appreciated by those skilled in the art informed by the teachings of the present invention that the concepts of the present invention may be applied to providing performance guarantees for join queries over substantially any number of relations.

FIG. 1 depicts two tables each comprising a list of attributes and rankings for the attributes. For example, FIG. 1 comprises a first table labeled Parts. The Parts table comprises three attributes, namely; availability, name and supplier id. FIG. 1 further comprises a second table labeled Suppliers. The Suppliers table comprises two attributes, namely; supplier id and quality. For purposes of explanation, it is assumed that all parts correspond to the same piece of a mechanical device, illustratively part P05, possibly of different brands. The rank attributes, availability and quality, determine the availability (i.e., current quantity in stock for this part) and the quality of the supplier (i.e., acquired by, for example, user experience reports on a particular supplier) respectively, having as a domain a subset of R+ (i.e., the greater the value the larger the preference towards that attribute value). A user interested in purchasing parts from suppliers will have to correlate, through a join on supplier id, the two tables. Rank attributes, could provide great flexibility in query specification in such cases. For example, a user looking for a part might be more interested in the availability of the part as opposed to supplier quality. In a similar fashion, supplier quality might be of greater importance to another user, than part availability. It is imperative to capture user interest or preference towards rank attributes spanning multiple tables to support such queries involving user preferences and table join results. User preference towards rank attributes is captured by allowing users to specify numerical values (weights), for each rank attribute (i.e., the larger the weights the greater the preference of the user towards these rank attributes). Assuming the existence of scoring functions that combine user preferences and rank attribute values returning a numerical score, the target queries of the present invention identify the k tuples in the join result of, for example in FIG. 1, Parts and Suppliers with the highest scores.

For example, let R, S depict two relations, with attributes A₁-A_(n) and B₁-B_(m), respectively. A1, B1 are rank attributes with domains a subset of R+ and θ, an arbitrary join condition defined between (sub)sets of the attributes A₂-A_(n), B₂-B_(m) (R

S). For a tuple, tεR

S, A_(i)(t) (and similarly B_(i)(t)) corresponds to the value of attribute A_(i) (and similarly B_(i)) of tuple, t. Furthermore, Let f: R+x R+→R+ be a scoring function that takes as input the pair of rank attribute values (s₁, s₂)=(A₁(t), B₁ (t)) of tuple tεR

S, and produces a score value f(s₁, s₂) for the tuple t. It should be noted that a function f: R+x R+→R+ is monotone if the following holds true: x₁≦x₂, and y₁≦y₂, then f(x₁, y₁)≦f(x₂, y₂).

For further explanation, let e=(p₁, p₂) denote the user defined preferences towards rank attributes A₁, B₁. As such, a linear scoring function, f_(e): R+x R+→R+, is defined as a scoring function that maps a pair of score values (s_(i), s₂) to the value f_(e)(s₁, s₂)=p₁s₁+p₂s₂. It is assumed that user preferences are positive (belonging to R+). This is an intuitive assumption as it provides monotone semantics to preference values (the greater the value the larger the preference towards that attribute value). In such a case, the linear function f_(e) is monotone as well. The symbol, £, is used to denote the class of monotone linear functions. Note that the pair of user defined preferences, e, uniquely determines a function, fε£.

Given the relations R, S, join condition θ and scoring function f_(e)ε£, a top-k query returns a collection T_(k)(e)

R

S of k tuples ordered by f_(e)(A₁(t), B₁ (t)), such that for all tεR

S, t∉T_(k)(e)

f_(e)(A₁(t), B₁ (t))≦f_(e)(A₁(t_(i)), B₁ (t_(i))), for all t_(i)εT_(k)(e), 1≦i≦k. Thus, a top-k join query returns as a result k tuples from the join of two relations with the highest scores, for a user specified scoring function, f_(e), among all tuples in the join result.

If the relations R, S to be joined consist of O(n) tuples, the size of the join relation R

S may be as large as O(n²). The inventors determined and demonstrate herein that most of the tuples of the join relation, R

S, are typically not necessary for answering top-k join queries. In particular, for a fixed value K<n, where K depicts an upper bound for the maximum requested result size of any top-k join query, and for the entire class of linear functions £, in the worst case, a number of tuples much smaller than O(n²) is sufficient to provide the answer to any top-k join query, k≦K.

In addition, it should be noted that there is no need to generate the complete join result R

S. For example, let C denote the subset of R

S necessary to generate, in the worst case, an index, providing answers with guaranteed performance on any top-k join query, k≦K, issued using any scoring function fε£. Note that although each tuple, t, of R could join in the worst case with O(n) tuples of S, for a fixed value of K, only t is joined with at most K tuples in S; the ones that have the highest rank values. Therefore, among the possible O(n) tuples in the join that are determined for each tuple, tεR, only the K tuples with the highest rank values are required. Due to the monotonicity property of functions in £, these K tuples will have the highest scores for any fεR. As such, the inventors disclose postulate one (1) which follows: For relations of size O(n) and a value K, the worst case size of C is O(nK).  (1)

Note that this worst case size is query independent (i.e., using the same set of tuples, C, of worst case size O(nK), any top-k join query, k≦K, for substantially any fε£ may be solved. In a preprocessing step, C may be determined by joining R and S and selecting for each tuple, tεR, the K (worst case) tuples contributed by t to the join result that have the highest rank values in S. Such a preprocessing step may be carried out in a fully declarative way using a Structured Query Language (SQL) interface, which is well-known in the art.

For further reduction of the size of C, the inventors disclose letting t and t′ denote two tuples of R

S and (s₁, s₂) and (s′₁, s′₂) denote the pairs of rank values associated with the tuples, respectively. Thus, tuple t′ dominates tuple t if s₁≦s′₁ and s₂≦s′₂. The domination property provides a basic means to reduce C even further.

As such, two methods of reducing the size of C are disclosed herein. That is, the determination that for relations of size O(n) and a value K, the worst case size of C is O(nK), reduces a join result by restricting the number of the tuples contributed to the join by a single tuple of a relation. In addition the domination property described above reduces the size of C by examining the tuples contributed to the join by multiple tuples of a relation. As such, the inventors disclose postulate two (2) which follows: For a value of K, if some tuple tεC is dominated by at least K other tuples, then t cannot be in the solution set of any top-k join query, k≦K.  (2)

Thus, from the monotonicity properties of the scoring functions, it is evident that a viable strategy to reduce the size of C is to identify all tuples in C dominated by at least K tuples. Formally, given a set C, the dominating set, D_(k), is the minimal subset of C with the following property: for every tuple t∉D_(k) with rank values (s₁, s₂), there are at least K tuples t_(i)εD_(k), that dominate tuple t.

FIG. 2 depicts an embodiment of an algorithm for computing the dominating set, D_(k) for substantially any value of K in accordance with the present invention. In the algorithm of FIG. 2, every tuple t_(i) in C is associated with a pair of rank values (s^(i) ₁, s^(i) ₂). The algorithm maintains a priority queue, Q, (supporting insertions/deletions in logarithmic time) storing the K largest s^(i) ₁ rank values encountered so far. The algorithm first sorts the tuples in the join result in non-increasing order with respect to the s^(i) ₂ rank values. The tuples are then considered one at a time in that order. For every tuple t_(i) (after the first K), if its s^(i) ₁ rank value is less than the minimum rank value present in Q, the tuple is discarded. Otherwise the tuple is included in the dominating set, and the priority queue, Q, is updated. The Algorithm Dominating Set of FIG. 2 requires a time equal to O(|C|log|C|) for sorting and computes the dominating set D_(k) in a time equal to O(|C|log K). The number of tuples reduced by the Dominating Set algorithm depends on the distribution of the rank value pairs in the join result. In practice the size of D_(k) is expected to be much smaller than O(nK). In the worst case, however, no tuple is dominated by K other tuples and, as a result, the Dominating Set algorithm does not achieve any additional reduction in the number of tuples.

FIGS. 3 a and 3 b graphically depict an example of a Dominating Set determined by the Dominating set algorithm for tables and attributes such as those of FIG. 1, having two different join results. FIG. 3 depicts the two pairs of relations and the different rank attribute values. For both pairs of relations, the size of the join result is the same (equal to 3). For the tuples of each join result in FIGS. 3 a and 3 b, a geometric analogy is drawn and the tuple is represented by the rank attribute pair, (quality, availability), as a point in two dimensional space. For the rank attribute value distributions in FIG. 3 a, the set D₁ has a size of 3 (worst case) since no tuple is dominated by any other tuple. Thus, in this case the Dominating Set algorithm determines the set D₁ having a size equal to the theoretically predicted worst case. In contrast, in FIG. 3 b, the Dominating Set algorithm determines a set D₁ with a size of 1 and containing the tuple whose rank attribute pair dominates the other two, for K=1.

The relationship among the sets, D_(k), associated with each top-k join query possible with k≦K may be characterized according to the following postulate, number three (3), which follows: Considering two top-k join queries requesting k₁, k₂ results and k₁≦k₂≦K, for the dominating sets D_(k1), D_(k2), D_(K), then D_(k1)

D_(k2)

D_(K).  (3)

Thus, it is determined that it is sufficient to identify and determine only the set D_(K) since the solutions to any top-k join query k≦K are contained in this set. This also holds true for any scoring function, fε£.

The inventors present above an algorithm to preprocess the set D_(K) and develop an index structure, considered by the inventors as RJI, which provides solutions to top-k join queries with guaranteed worst case access time. Every function, fε£, is completely defined by a pair of preference values (p₁, p₂). The value of the function, f, on a tuple, tεD_(K) with rank values (s₁, s₂) is equal to p₁s_(s)+p₂s₂. The index structure, RJI, is constructed by representing members of £ and rank value pairs for each tεD_(K) as vectors in two-dimensional space. Since every f_(e)ε£ is completely defined by the pair e=(p₁,p₂), every function, f, may be depicted by the vector e=

(0,0)(p₁,p₂)

on the plane. Similarly, the rank value pairs may be characterized as a vector s=

(0,0)(s₁,s₂)

. In light of the preceding geometric relations, the value of a function, f, on a tuple tεD_(K) with rank values (s₁,s₂) is the inner product of the vectors e and s. The reasoning behind representing members of class of monotone linear functions, £, as vectors may be explained as follows. Assume that ∥e∥=1 (i.e., the vector, e, is a unit vector), then the value of the function, f_((p1,p2))(s₁,s₂), is the length of the projection of the vector s on the vector e. It should be noted, however, that the assumption that the vector, e, is a unit vector is solely for the purposes of simplifying the presentation. It should not be interpreted as being required for the correctness of the approach of the present invention. The result of any top-k join query T_(k)(e) is the same independent of the magnitude of the vector, e. For example, letting u=αe be some vector in the direction of e with length α, T_(k)(e) is the same as T_(k)(u) since the lengths of the projected vectors change only by a scaling factor, and thus, their relative order is not affected.

As previously depicted, the set of tuples D_(K) may be represented as points in two dimensional-space using the rank values of each tuple. Given a unit vector e, the angle a(e) of the vector is defined as the angle of e with the axis representing (without loss of generality) the s₁ rank values. For a set of l tuples {t₁, t₂, . . . , t₁}, Ord_(e)({t₁, t₂, . . . , t_(l)}) is defined as the ordering of the tuples {t₁, t₂, . . . , t_(l)} when the rank value pairs associated with each tuple are projected on the vector e, and are sorted by non-increasing order of their projection lengths. Ord_(e)({t₁, t₂, . . . , t₁})is used to denote the reverse of that ordering. T_(k)(e) contains the top k tuples in the ordering Ord_(e)({t₁, t₂, . . . , t_(l)}).

Let the vector, e, sweep the plane defined by the domains of rank attributes (R+x R+). Specifically, let the sweep start from the s₁-axis and move towards the s₂-axis (i.e., counter-clockwise). Thus, e ranges from e=

(0,0)(1,0)

to e=

(0,0),(0,1)

. As such, to examine how the ordering Ord_(e)(D_(K)) varies as e sweeps the plane, two tuples and their relative order are first considered. That is, let s₁=(s₁ ¹, s₂ ¹) and s₂=(s₁ ², s₂ ²) be the rank value pairs for two tuples t₁, t₂εD_(K). Since rank value pairs are represented as vectors, let

s¹, s²

=s²−s¹ denote the vector defined by the difference of s² and s¹, and let b denote the angle of the vector

s¹, s²

with the s₁-axis. Having done so, the inventors disclose postulate four (4), which follows:

-   -   Depending on the angle, b, that vector         s¹, s²         forms with the s₁-axis as e sweeps the plane, one of the         following holds true:     -   (a) if bε[0, π/2], Ord_(e)({t₁, t₂}) is the same for all e.     -   (b) if bε[−π/2, 0] U [π/2, π], let e_(s) be the vector         perpendicular to         s¹,s²         , and as such:         -   (i) f_(es)(s₁ ¹,s₂ ¹)=f_(es)(s₁ ², s₂ ²),         -   (ii) Ord_(e1),({t₁, t₂})=Ord_(e2)({t₁, t₂}), for all vectors             e₁,e₂ with a(e₁), a(e₂)>a(e_(s)), or a(e₁), a(e₂)<a(e_(s)),         -   (iii) Ord_(e1)({t₁, t₂})= Ord _(e2)({t₁, t₂}), for all             e₁,e₂, such that a(e₁)<a(e_(s))<a(e₂). Moreover, as a vector             e sweeps the positive quadrant, tuples t₁, t₂ are adjacent             in the ordering Ord_(e)(D_(K)) immediately before e crosses             vector e_(s), and remain adjacent in Ord_(e)(D_(K))             immediately after e crosses vector e_(s).

The principles presented above indicate that as e sweeps a plane, the ordering of tuples t₁ and t₂ changes only when e crosses the vector e_(s), which is defined as the vector perpendicular to

s¹, s²

. If the vector

s¹, s²

has a positive slope, then the ordering of the tuples t₁, t₂ remains the same for all e. The vector e_(s) is considered the separating vector of tuples t₁ and t₂, and a(e_(s)) is considered the separating point.

FIG. 4 a and FIG. 4 b depict a graphical representation of the ordering of two tuples for two different values of the angle, b, that the vector

s¹, s²

forms with the s₁-axis as e sweeps the plane. In FIG. 4 a and FIG. 4 b two tuples, t₁ and t₂ are graphed along with a representation of the separating vector, e_(s), of the tuples, t1 and t₂ and a graphical representation of the angle, b. More specifically, FIG. 4 a graphically depicts an example of the ordering of two tuples t₁, t₂ when the vector

s¹, s²

has a positive slope. As evident in FIG. 4 a, the ordering of the tuples t₁, t₂ remains the same for all e. FIG. 4 b graphically depicts an example of the ordering of the two tuples t₁, t₂ for the second case above where the vector

s¹, s²

has an other-than-positive slope. Although only two tuples, t₁ and t₂ are depicted in FIG. 4 a and FIG. 4 b, it should be noted that more than two tuples may share the same separating vector. For example, if t₁, t₂ and t₃ are three tuples such that their corresponding rank value pairs are co-linear, the three tuples t₁, t₂ and t₃ all share the same separating vector. As such, the inventors disclose postulate five (5), which follows: If t ₁ , t ₂ . . . t _(l) are l tuples with colinear rank value pairs sharing the same separating vector, e _(s), then Ord_(e1)({t ₁ , t ₂ . . . t _(l)})=Ord_(e2)({t ₁ , t ₂ t _(l)}) for all a(e ₁), a(e ₂) such that a(e ₁)<a(e _(s))<a(e ₂).  (5) Briefly stated, each separating vector corresponds to the reversal of two or more adjacent points.

FIG. 5 depicts an embodiment of an RJI Construct algorithm in accordance with the present invention, which preprocesses the set of tuples, D_(K), and constructs an index on its elements. In the algorithm of FIG. 5, a vector, e, sweeps the plane and the composition of T_(K)(e) is monitored. Every time vector e crosses a separating vector, Ord_(e)(D_(K)) changes by swapping two (or more if they are colinear) adjacent tuples as described above. A key observation is that this swap is of interest for indexing purposes only if it causes the composition of T_(K)(e) to change. Assuming that D_(K) contains tuples of the form (tid_(i), s₁ ^(i), s₂ ^(i)), where tid_(i) is a tuple identifier, and s₁ ¹, s₂ ^(i) are the associated rank values, the algorithm of FIG. 5 initiates by first computing the set V of all separating vectors. This involves considering each pair of tuples in D_(K) and computing their separating vector and the associated separating point. Let e_(si)(a(e_(si))) represent the separating vector (separating point) for each pair of tuples, t_(i), t_(j), 1≦, j≦|D_(K)|. Each pair (tid_(i), tid_(y)) along with the associated separating point a(e_(si)), is computed and materialized as set V. Then set V is sorted in non-decreasing order of a(e_(si)).

The algorithm then sweeps the (positive quadrant of the) plane, going through the separating vectors in V in sorted order. The algorithm maintains also a set, R, that stores (unsorted) the K tuples with highest score according to the function, f_(e), where e is the current position of the sweeping vector. R is initialized to hold the top-k tuples with respect to the initial position of vector, e, namely e=

(0, 0)(1, 0)

(function f_((1,0))). Initializing R is easy, since the set, D_(K), computed at the end of the Dominating Set algorithm is sorted by s₁ ^(i).

Each a(e_(si)) in the set, V, (and the corresponding vector e_(si)) is associated with two tuple identifiers (t_(i), t_(j)). When e crosses the vector e_(si) during the sweep, it causes the ordering of tuples t_(i), t_(j) to change according to Postulates 4 and 5 depicted above. In case both tuple identifiers belong to R, or neither belongs to R, the vector e_(si), can be safely discarded from consideration, since it does not affect the composition of R. Otherwise, a(e_(si)) is determined together with the composition of R, and R is updated to reflect the new tuple identifiers. The last value of R is also determined after the sweep is completed. At the end of the RJI Construct algorithm, M separating vectors, e₁,e₂, . . . , e_(M) have been accumulated (represented by their separating points a(e_(i)), 1≦i≦M). The accumulation of the vectors, e_(i) 1≦i≦M, partitions the quadrant into M+1 regions. Each region i, 0≦i≦M, is defined by vectors e_(i), e_(i+1), where e₀=

(0,0)(1,0)

and e_(M+1)

(0,0)(0,1)

. Region i is associated with a set of K points R_(i)

D_(K), such that for any vector, e, with a(e_(i))≦a(e)≦a(e_(i+1)), uniquely identifying a function f_(e)ε£, T_(K) (e) is equal to a permutation of R_(i). This permutation is derived by evaluating f_(e) on every element of R_(i) and then sorting the result in non-increasing order. That is, R_(i) contains (up to a permutation) the answer to any top-k query, k≦K for any function defined by a vector in region i.

For example, FIG. 6 a and FIG. 6 b graphically depict an example of the operation of the RJI Construct algorithm. FIG. 6 a and FIG. 6 b comprise a set, D₂, consisting of four tuples, t₁, t₂, t₃, t_(a). The RJI Construct algorithm starts by computing the separating vector for each pair of tuples. For ease of explanation and brevity, in FIG. 6 a the separating vectors are presented only for pairs of tuples t₂, t₃, t₄. The separating vectors e₃₄, e₂₄, and e₂₃ are computed for each pair as shown in FIG. 6 a. Each pair is stored along with the associated separating point and the collection is ordered based on separating points. Setting K=2, an index is created answering the top-1 and top-2 join queries.

Consider now a vector, e, sweeping the plane. The first two tuples in Ord_((1,0))(D₂) are R={t₁,t₄}. The first vector crossed by e is e₃₄, which corresponds to swapping tuples t₃ and t₄. The swap changes the composition of R. In particular, t₄ is replaced with t₃. At this point, a(e₃₄) is stored along with the R₀=R={t₁,t₄} and the current composition of R becomes R={t₁,t₃}. Then a(e₂₄) is encountered in the sorted order but the swap of t₂,t₄ does not affect the composition of R. The next vector in the sorted order is e₂₃. The composition of R is affected such that a(e₂₃) is stored along with R₁=R={t₁,t₃} and the current composition of R changes to R={t₁,t₂}. When the input is exhausted, the current ordering R₂=R={t₁,t₂} is stored, and the algorithm terminates. FIG. 6 b depicts the final partitioning of the plane.

Critical to the size of the index is the size of M, the number of separating vectors identified by the RJI Construct algorithm. A worst case bound is provided on M by bounding the number of times that a tuple identifier can move from position K+1 to position K in Ord_(e)(D_(K)). Postulates 4, 5 previously presented guarantee that whenever a swap happens between elements of Ord_(e)(D_(K)), it takes place between two adjacent elements in Ord_(e)(D_(K)). Thus, only the separating vectors that cause a swap of the elements in positions K and K+1 in Ord_(e)(D_(K)) are indexed, since these are the ones that cause the composition of T to change. For every t_(i)εD_(K) define rank_(ti)(e) to be the position of tuple t_(i) in the ordering Ord_(e)(D_(K)). As such, the inventors disclose postulate six (6), which follows: For every tuple t _(i) , εD _(K), rank_(ti)(e) can change from l+1 to l at most l times for any vector e, l≦K.  (6) In addition, the inventors disclose the following Theorem:

-   -   Given a set of dominating points D_(K), an index may be         constructed for top-k join queries in time O(|D_(K)|²         log|D_(K)|) using space O(|D_(K)|K²) providing answers to top-k         join queries in time O(log|KD_(K)|+K log K), k≦K in the worst         case.

Postulate 6 guarantees that each element in DK contributes at most K changes to T_(K)(e). This means that each tuple introduces at most K separating vectors and consequently introduces K separating points that need to be stored in the worst case. Therefore, the number M of separating points is at most O(|D_(K)|K). After the separating points a(e_(s)) are identified, they are organized along with the associated sets R_(i) in a B-tree indexed by a(e_(s)). The leaf level stores pointers to the sets R_(i). Thus, the total space requirement becomes O(|D_(K)|K²). There are O(nK) elements in D_(K) in the worst case, so the number M of separating points that require representation in the index is at most O(nK²). Thus, the total space used by this structure in the worst case is O(nK³). The worst case time complexity for constructing the ranked join index is O(n²K²) time to compute the separating vectors and separating points and O(n²K² log(n²K²)) time to sort the separating points. Constructing a B-tree may be performed during the single scan on the sorted separating point collection of the RJI Construct algorithm. Thus, the total construction time is O(n²K² log(n²K²)). It should be noted that these are the worst case space and construction time requirements for the index RJI.

At query time, given the vector, e, that defines a function, f_(e)ε£, a(e) is computed and the B-tree is searched using a(e) as a key. This effectively identifies the region that contains the vector, e. Then, the associated set R1 is retrieved and f_(e) evaluated for all elements of R_(i), sorting the results to produce T_(k)(e). Thus, the query time is O(log(nK²)+K log K) in the worst case, for any top-k join query, k≦K.

The ranked join index design of the present invention provides a variety of space-time tradeoffs which can be utilized to better serve the performance/space constraints in various settings. If the space is a critical resource, the space requirements could be decreased significantly, at almost no expense on query time. Note that sets R_(i) and R_(i+1) associated with two neighboring regions differ, in the worst case, by only one tuple. Therefore, the set R_(i) U R_(i+1) contains K+1 distinct tuples. If m regions are merged, then the resulting region contains at most K+m−1 distinct tuples. It should be noted that this is a worst case bound. Depending on the distribution, a region may contain less than K+m−1 distinct tuples. Therefore, if there are initially M separating vectors, merging every m regions reduces the number of separating vectors to M/m. The space for the index becomes O(M(K+m)/m), and the query time O(log(M/m)+(K+m)log(K+m)). Since M=O(nK²) in the worst case, the requirements of the index are O(nK²(K+m)/m) for space, and O(log(nK²/m)+(K+m) log(K+m)) for query time.

For example, FIGS. 7 a, 7 b and 7 c graphically depict an example of the space-time tradeoffs of the RJI Construct algorithm for K=2. Every two regions of FIG. 7 a are merged and the result is depicted in FIG. 7 b. Merging m regions does not always result in a region with K+m−1 tuples as described above. Depending on the distribution of the rank values, it may be the case that as the vectors that define the m regions are crossed, some points move in and out of the top K positions multiple times. In this case, merging m regions results in a region with far less than K+m−1 distinct tuples. As such, instead of merging every m regions, the regions may be merged so that every region (except possibly the last one) contains exactly K+m−1 distinct tuples. This allows for more aggressive reduction of space, without affecting the worst case query time. If fast query time is the main concern, the query time may be reduced by storing all separating vectors that cause T_(K)(e) to change. According to Postulate 6 described above, a tuple may move from position l+1 to 1 at most l times, therefore, each tuple may contribute at most 1+2+ . . . +K=K(K±1)/2 changes to T_(K)(e). Thus, storing at most O(nK³) separating vectors the query time may be reduced to O(log(nK³)). Effectively in this case an ordered sequence of points is being stored in each region R_(i) so there is no need for evaluating f_(e), on the elements of the region. The ordered sequence (according to f_(e)) may be returned immediately. FIG. 7 c depicts a materialization of the separating points causing a change in ordering for the tuples in each region of FIG. 7 a.

The inventors further disclose herein a variant of a range search procedure of an R-tree index that is specifically designed to answer top-k join queries. This provides a base-case for performance comparison against a solution provided by the present invention. Briefly stated, an R-tree index is implemented to prune away a large fraction of the tuples that are bound not to be among the top k. This modified R-tree is referred to by the inventors as the TopKrtree. Consider the two-dimensional space defined by the 2 rank values associated with each tuple in D_(K) returned by the Dominating Set algorithm. An R-tree on these points is constructed using R-tree construction algorithms know in the art. A basic observation is that due to the monotonicity property of the functions fε£, given a Minimum Bounding Rectangle (MBR), r, at any level in that tree, the minimum and maximum score values for all tuples inside r are bounded by the value any scoring function in £ gets at the lower left and upper right corners of r. Following this observation the R-tree search procedure is modified according to the following.

At each node in the R-tree, instead of searching for overlaps between MBRs, the procedure searches for overlaps between the intervals defined by the values of the scoring function in the upper right and lower left corners of the MBRs. The algorithm recursively searches the R-tree and maintains a priority queue collecting k results.

For example, FIG. 8 a and FIG. 8 b graphically depict an embodiment of an R-tree with three MBRs, namely r₁, r₂, and r₃, and a top-k join query with e=(p₁,p₂). The largest score that a point in an MBR can possibly achieve is the score given by the projection of the upper right corner of the MBR on vector e. This projection is referred to by the inventors as the maximum-projection for the MBR, and the MBR that has the largest maximum-projection among all the MBRs of the same R-tree node as the master MBR. Similarly, the lowest score is given by the projection of the lower left corner (minimum-projection) of the MBR. A simplified embodiment of the algorithm, named TopKrtree Answer, is presented in FIG. 9. For brevity, it is assumed that each MBR contains at least K tuples. Therefore, the algorithm guiding the search uses only the master MBR at each R-tree level. Accounting for the case where multiple MBR's are required is immediate by maintaining a list of candidate MBRs ordered by their maximum projections at each level. This resembles the type of search performed while answering nearest-neighbor queries using R-trees. In the TopKrtree Answer algorithm of FIG. 9, the MBR with the largest maximum-projection is always the candidate to search and expand further for obtaining the answer to the top-k query. This is rectangle r₁ in FIG. 8 a, since its maximum-projection r₁ ^(h) is the largest among the three MBRs. In this case, all MBRs with maximum-projection less than the minimum-projection of the master MBR may be safely pruned away. In this example the tuples in r₃ will not be examined since all these tuples have scores less than the minimum score of all the tuples in r₁. However, the algorithm will examine all MBRs with maximum-projection greater than the minimum-projection of the master MBR. The range of projections of such MBRs overlap, and the answer to the top-k query may be a collection of tuples coming from all those MBRs. Therefore, in order to get the correct answer, all of the MBRs whose projections on vector e overlap with the projection of the master MBR must be examined. It should be noted, however, that there are many cases in which the TopKrtree accesses more MBRs than really necessary. For example, FIG. 8 b, depicts a top-2 query with e=(p₁, p₂). Evidently, the answer to this query is the set of tuples {t₁, t₂}, both contained in r₂. Observe that even though r₁ has the largest maximum-projection (e.g., r₁ ^(n)) none of its tuples (e.g., t₃) are contained in the top-2 answer. Thus, all the computations involving r₁ are useless in this case.

FIG. 10 depicts a high level block diagram of an embodiment of a controller suitable for performing the methods (i.e., algorithms) of the present invention. The controller 1000 of FIG. 10 comprises a processor 1010 as well as a memory 1020 for storing the algorithms and programs of the present invention. The processor 1010 cooperates with conventional support circuitry 1030 such as power supplies, clock circuits, cache memory and the like as well as circuits that assist in executing the software routines stored in the memory 1020. As such, it is contemplated that some of the process steps discussed herein as software processes may be implemented within hardware, for example, as circuitry that cooperates with the processor 1010 to perform various steps. The controller 1000 also contains input-output circuitry 1040 that forms an interface between the various functional elements communicating with the controller 1000.

Although the controller 1000 of FIG. 10 is depicted as a general purpose computer that is programmed to perform various methods and operations in accordance with the present invention, the invention may be implemented in hardware, for example, as an application specified integrated circuit (ASIC). As such, the process steps described herein are intended to be broadly interpreted as being equivalently performed by software, hardware, or a combination thereof.

While the forgoing is directed to various embodiments of the present invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof. As such, the appropriate scope of the invention is to be determined according to the claims, which follow. 

1. A method of creating a ranked join index for ordered data entries, comprising: mapping a dominating set of the ordered data entries according to rank attributes; determining a separating vector for each set of adjacent mapped data entries of the dominating set of ordered data entries; and ordering the ordered data entries according to a separating point associated with each of the separating vectors, wherein the ordering is performed by a processor.
 2. The method of claim 1, wherein the ordering the ordered data entries, comprises: sweeping a vector across a plane of the adjacent mapped data entries, wherein each time the vector crosses a separating vector, a current composition of highest ranked data entries changes by swapping a data entry in a respective set of the adjacent mapped data entries if it causes a change in the index; and wherein each time a data entry in a respective set of adjacent mapped data entries is swapped, the highest ranked data entries are materialized and a new index entry is initiated.
 3. The method of claim 1, wherein the ordering is query independent such that any user preference query is resolved using the index.
 4. The method of claim 1, wherein each set of adjacent mapped data entries comprises more than two mapped data entries of the ordered data entries if the more than two data entries are collinear.
 5. The method of claim 1, further comprising: providing a performance guarantee for an amount of time the index requires for resolving user queries.
 6. The method of claim 1, further comprising merging ordered data entries.
 7. The method of claim 6, wherein said merging results in a storage space requirement for said index that is characterized according to an equation: O(nK²(K+m)/m) wherein n represents a total number of data entries to be indexed, K represents an upper bound on a number of high ranking data entries that is requested by a user, and m represents a total number of data entries to be merged.
 8. The method of claim 6, wherein the merging results in a query time for the index that is characterized according to an equation: O(log(nK²/m)+(K+m)log(K+m)) wherein n represents a total number of data entries to be indexed, K represents an upper bound on a number of high ranking data entries that is requested by a user, and m represents a total number of data entries to be merged.
 9. The method of claim 6, wherein the merging the ordered data entries provides a space and time tradeoff.
 10. The method of claim 9, wherein the space and time tradeoff comprises reducing a query time of the index by increasing a storage space of the index.
 11. The method of claim 9, wherein the space and time tradeoff comprises reducing a storage space required by the index by increasing a query time of the index.
 12. A method of providing solutions to top-k join queries of ranked data entries for user specified preferences, comprising: mapping a dominating set of the ranked data entries according to rank attributes; creating a ranked join index for the ranked data entries by determining a separating vector for each set of adjacent mapped data entries of the dominating set of ranked data entries; ordering the ranked data entries according to a separating point associated with each of the separating vectors, wherein the ordering is performed by a processor; and providing a solution for a user preference query using the ranked join index.
 13. A non-transitory computer-readable medium storing a set of instructions, which when executed by a processor, perform a method of creating a ranked join index for ordered data entries, comprising: mapping a dominating set of the ordered data entries according to rank attributes; determining a separating vector for each set of adjacent mapped data entries of the dominating set of ordered data entries; and ordering the ordered data entries according to a separating point associated with each of the separating vectors.
 14. The non-transitory computer-readable medium of claim 13, wherein the ordering the ordered data entries, comprises: sweeping a vector across a plane of the adjacent mapped data entries, wherein each time the vector crosses a separating vector, a current composition of highest ranked data entries changes by swapping a data entry in a respective set of the adjacent mapped data entries if it causes a change in the index; and wherein each time a data entry in a respective set of adjacent mapped data entries is swapped, the highest ranked data entries are materialized and a new index entry is initiated.
 15. The non-transitory computer-readable medium of claim 13, wherein the ordering is query independent such that any user preference query is resolved using the index.
 16. The non-transitory computer-readable medium of claim 13, wherein each set of adjacent mapped data entries comprises more than two mapped data entries of the ordered data entries if the more than two data entries are collinear.
 17. The non-transitory computer-readable medium of claim 13, wherein performance guarantees are provided for an amount of time the index requires for resolving user queries.
 18. The non-transitory computer-readable medium of claim 13, further comprising merging ordered data entries.
 19. The non-transitory computer-readable medium of claim 18, wherein the merging results in a storage space requirement for the index that is characterized according to an equation: O(nK²(K+m)/m) wherein n represents a total number of data entries to be indexed, K represents an upper bound on a number of high ranking data entries that is requested by a user, and m represents a total number of data entries to be merged.
 20. The non-transitory computer-readable medium of claim 18, wherein the merging results in a query time for the index that is characterized according to an equation: O(log(nK²/m)+(K+m)log(K+m)) wherein n represents a total number of data entries to be indexed, K represents an upper bound on a number of high ranking data entries that is requested by a user, and m represents a total number of data entries to be merged. 